Independent set - PDFSEARCH.IO - Document Search Engine

Independent set
Results: 651

#	Item
101	Fixed-Parameter Tractability of Token Jumping on Planar Graphs arXiv:1406.6567v2 [cs.DM] 11 MarTakehiro Ito1 , Marcin Kami´ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-03-11 21:08:35 Graph theory NP-complete problems Planar graphs Independent set Graph Matching Ear decomposition Clique Bipartite graph Line graph Chordal graph
102	Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs Add to Reading List Source URL: www.csc.kth.se Language: English - Date: 2013-01-22 04:13:46
103	ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS NIKOS FRANTZIKINAKIS AND BRYNA KRA Abstract. Szemer´edi’s Theorem states that a set of integers with positive upper density contains arbitrarily long arith Add to Reading List Source URL: www.math.northwestern.edu Language: English - Date: 2006-05-10 12:51:05
104	SEAProgram Monday, June 29th 8:00 8:50 9:00 Add to Reading List Source URL: sea2015.lip6.fr Language: English - Date: 2015-06-14 11:10:18 NP-complete problems Computational complexity theory Steiner tree problem Combinatorial optimization Shortest path problem Mathematical optimization Independent set Combinatorics Graph theory Book:Graph Theory
105	COMPUTING CONVEX QUADRANGULATIONS F. AURENHAMMER, M. DEMUTH, AND T. SCHIFFER A BSTRACT. We use projected Delaunay tetrahedra and a maximum independent set approach to compute large subsets of convex quadrangulations on a Add to Reading List Source URL: www.igi.tugraz.at Language: English - Date: 2016-02-13 09:27:27
106	arXiv:astro-phv1 12 SepNew Constraints on ΩM, ΩΛ, and w from an Independent Set of Eleven High-Redshift Supernovae Observed with HST1 R. A. Knop2,3,4 , G. Aldering5,4 , R. Amanullah6 , P. Astier7 , G Add to Reading List Source URL: web.physics.ucsb.edu Language: English - Date: 2004-07-22 15:14:55
107	NetworkX Reference ReleaseAric Hagberg, Dan Schult, Pieter Swart September 20, 2014 Add to Reading List Source URL: networkx.github.io Language: English - Date: 2016-03-06 02:10:20 Graph theory NetworkX Graph Line graph DOT Directed graph Multigraph Clique Independent set Sparksee Connectivity Degree
108	Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:23 Graph theory Mathematics Computational complexity theory NP-complete problems Dominating set Independent set Vertex cover Connected dominating set Set cover problem Line graph Metric k-center Domatic number
109	Beeping a Maximal Independent Set Yehuda Afek1 , Noga Alon1,2 , Ziv Bar-Joseph3 , Alejandro Cornejo4 , Bernhard Haeupler4 , and Fabian Kuhn5 1 3 Add to Reading List Source URL: ac.informatik.uni-freiburg.de Language: English - Date: 2012-04-03 09:53:32
110	NetworkX Reference Release 1.9 Aric Hagberg, Dan Schult, Pieter Swart June 21, 2014 Add to Reading List Source URL: networkx.github.io Language: English - Date: 2016-03-06 02:10:21 Graph theory NetworkX Graph DOT Line graph Multigraph Independent set Directed graph Connectivity Sparksee Clique Degree

UPDATE